Shivers' Control Flow Analysis
نویسنده
چکیده
In his dissertation [3], Olin Shivers introduces a concept of control flow graphs for functional languages, provides an algorithm to statically derive a safe approximation of the control flow graph and proves this algorithm correct. In this research project [1], Shivers’ algorithms and proofs are formalized using the HOLCF extension of the logic HOL in the theorem prover Isabelle.
منابع مشابه
Modular Control-Flow Analysis with Rank 2 Intersection Types
The performance of optimising compilers crucially depends on the availability of controlflow information at compile time. For any first-order imperative program, such information is available via a flowchart constructed from the program text. Consequently, traditional dataflow analyses can be used to perform a series of compile-time program optimisations (Aho et al. 1986). For higher-order prog...
متن کاملUseless-Variable Elimination
1 Intro In my 1988 SIGPLAN paper “Control-Flow Analysis in Scheme,” I promised to cover several items in more detail in a “forthcoming tech report.” The tech report has yet to happen. Most of the promised items have been covered in other papers (“The Semantics of Scheme Control-Flow Analysis” and “Data-Flow Analysis and Type Recovery in Scheme”). Useless-variable elimination, however, is still ...
متن کاملEnvironment Analysis via ∆CFA
We describe a new program-analysis framework, based on CPS and procedure-string abstractions, that can handle critical analyses which the k-CFA framework cannot. We present the main theorems concerning correctness, show an application analysis, and describe a running implementation.
متن کاملCFA2: A Context-Free Approach to Control-Flow Analysis
In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k -CFA, do not handle call and return well: they remember only a bounded number of pending calls because they approximate programs with control-flow graphs. Call/return mismatch introduces precisiondegrading spurious control-flow paths and increases the analysis ...
متن کاملAnalyzing the environment structure of higher-order languages using frame strings
Reasoning about program behaviour in programming languages based on the λ calculus requires reasoning in a unified way about control, data and environment structure. Previous analysis work has done an inadequate job on the environment component of this task. We develop a new analytic framework, ∆CFA, which is based on a new abstraction: frame strings, an enriched variant of procedure strings th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010